Construction of minimal non-abelian left group codes
نویسندگان
چکیده
Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class of groups G. As an illustration of our methods, alternative constructions to some best linear codes over F2 and F3 are given. Furthermore, we give constructions of non-abelian left group codes.
منابع مشابه
Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups
A definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite abelian group can be constructed from its characteristic generators, which extends the work of Koetter and Vardy who treated the case of a linear code over a f...
متن کاملTanner graphs for group block codes and lattices: Construction and complexity
We develop a Tanner graph (TG) construction for an Abelian group block code with arbitrary alphabets at different coordinates, an important application of which is the representation of the label code of a lattice. The construction is based on the modular linear constraints imposed on the code symbols by a set of generators for the dual code . As a necessary step toward the construction of a TG...
متن کاملIdempotents in group algebras and minimal abelian codes
We compute the number of simple components of a semisimple finite abelian group algebra and determine all cases where this number is minimal; i.e. equal to the number of simple components of the rational group algebra of the same group. This result is used to compute idempotent generators of minimal abelian codes, extending results of Arora and Pruthi [S.K. Arora, M. Pruthi, Minimal cyclic code...
متن کاملAn Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups - Information Theory, IEEE Transactions on
We present an efficient algorithm for computing the minimal trellis for a group code over a finite abelian group, given a generator matrix for the code. We also show how to compute a succinct representation of the minimal trellis for such a code, and present algorithms that use this information to compute efficiently local descriptions of the minimal trellis. This extends the work of Kschischan...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 75 شماره
صفحات -
تاریخ انتشار 2015